CT-CPP: Coverage Path Planning for 3D Terrain Reconstruction Using Dynamic Coverage Trees

نویسندگان

چکیده

This letter addresses the 3D coverage path planning (CPP) problem for terrain reconstruction of unknown obstacle rich environments. Due to sensing limitations, proposed method, called CT-CPP, performs layered scanning region collect data, where traveling sequence is optimized using concept a tree (CT) with TSP-inspired traversal strategy. The CT-CPP method validated on high-fidelity underwater simulator and results are compared an existing following CPP method. show that yields significant reduction in trajectory length, energy consumption, error.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Control for Constrained Coverage Path Planning

The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the ef...

متن کامل

Multi-Robot Path Planning for Selective Coverage

In this paper we propose a reward-driven finitehorizon model akin to a Markov Decision Process to extract the maximum amount of valuable data in least amount of time. We present a path planning algorithm that generates off-line trajectories for multiple robots to cover a region of interest by visiting the hot-spots in increasing order of their significance. An underlying distribution is assumed...

متن کامل

Coverage Path Planning for Mobile Cleaning Robots

In this paper a path planning algorithms for a mobile cleaning robot is developed. An exact cellular decomposition divides an environment in multiple smaller regions called cells. To produce an efficient cleaning path, the order in which these cells are cleaned is important. This paper describes how the optimalization of this path can be formulated as a Traveling Salesman Problem. Furthermore a...

متن کامل

Coverage Path Re-planning for Processing Faults

Currently, an automated surface treatment or finishing (e.g., abrasive blasting, cleaning or painting) is performed in two consecutive steps: first processing by tool, second quality evaluation by sensor. Often, a finished surface has defects like areas not properly processed. This is caused by path inaccuracy or errors in tool deployment. The defected areas can be detected only during a subseq...

متن کامل

Coverage Path Planning: The Boustrophedon Cellular Decomposition

Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, oor scrubbing, and inspection. We developed the boustrophedon cellular decomposition, which is an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon is covered with simple back and forth ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2022

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2021.3119870